On the Graph Bisection Cut Polytope
نویسندگان
چکیده
منابع مشابه
On the Graph Bisection Cut Polytope
Given a graph G = (V,E) with node weights φv ∈ N ∪ {0}, v ∈ V , and some number F ∈ N∪{0}, the convex hull of the incidence vectors of all cuts δ(S), S ⊆ V with φ(S) ≤ F and φ(V \ S) ≤ F is called the bisection cut polytope. We study the facial structure of this polytope which shows up in many graph partitioning problems with applications in VLSI-design or frequency assignment. We give necessar...
متن کاملBetween Min Cut and Graph Bisection between Min Cut and Graph Bisection
We investigate a class of graph partitioning problems whose two extreme representatives are the well-known Min Cut and Graph Bisection problems. The former is known to be eeciently solvable by ow techniques, the latter to be NP-complete. The results presented in this paper are { a monotony result of the type \The more balanced the partition we look for has to be, the harder the problem". { a co...
متن کاملCut Size Statistics of Graph Bisection Heuristics
We investigate the statistical properties of cut sizes generated by heuristic algorithms which solve the graph bisection problem approximately. On an ensemble of sparse random graphs, we find empirically that the distribution of the cut sizes found by “local” algorithms becomes peaked as the number of vertices in the graphs becomes large. Evidence is given that this distribution tends toward a ...
متن کاملOn the directed cut cone and polytope
In this paper we study the directed cut cone and polytope which are the positive hull and convex hull of all directed cut vectors of a complete directed graph, respectively. We present results on the polyhedral structure of these polyhedra. A relation between directed cut polyhedra and undirected cut polyhedra is established that provides families of facet defining inequalities for directed cut...
متن کاملOn the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
Recursive spectral bisection (RSB) is a heuristic technique for finding a minimum cut graph bisection. To use this method the second eigenvector of the Laplacian of the graph is computed and from it a bisection is obtained. The most common method is to use the median of the components of the second eigenvector to induce a bisection. We prove here that this median cut method is optimal in the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2008
ISSN: 0895-4801,1095-7146
DOI: 10.1137/060675253